TSTP Solution File: SET096^1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SET096^1 : TPTP v8.1.2. Released v3.6.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n005.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Sun May 5 09:03:53 EDT 2024
% Result : Theorem 0.16s 0.33s
% Output : Refutation 0.16s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.10 % Problem : SET096^1 : TPTP v8.1.2. Released v3.6.0.
% 0.10/0.11 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.11/0.31 % Computer : n005.cluster.edu
% 0.11/0.31 % Model : x86_64 x86_64
% 0.11/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.31 % Memory : 8042.1875MB
% 0.11/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.31 % CPULimit : 300
% 0.16/0.31 % WCLimit : 300
% 0.16/0.31 % DateTime : Fri May 3 16:55:53 EDT 2024
% 0.16/0.31 % CPUTime :
% 0.16/0.31 This is a TH0_THM_EQU_NAR problem
% 0.16/0.31 Running vampire_ho --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_hol --cores 8 -m 12000 -t 300 /export/starexec/sandbox2/tmp/tmp.1VpC4oaq5b/Vampire---4.8_27763
% 0.16/0.33 % (27876)lrs+1002_1:1_au=on:bd=off:e2e=on:sd=2:sos=on:ss=axioms:i=275:si=on:rtra=on_0 on Vampire---4 for (2999ds/275Mi)
% 0.16/0.33 % (27874)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on Vampire---4 for (2999ds/2Mi)
% 0.16/0.33 % (27871)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on Vampire---4 for (2999ds/183Mi)
% 0.16/0.33 % (27873)dis+1010_1:1_au=on:cbe=off:chr=on:fsr=off:hfsq=on:nm=64:sos=theory:sp=weighted_frequency:i=27:si=on:rtra=on_0 on Vampire---4 for (2999ds/27Mi)
% 0.16/0.33 % (27872)lrs+10_1:1_c=on:cnfonf=conj_eager:fd=off:fe=off:kws=frequency:spb=intro:i=4:si=on:rtra=on_0 on Vampire---4 for (2999ds/4Mi)
% 0.16/0.33 % (27878)lrs+10_1:1_bet=on:cnfonf=off:fd=off:hud=5:inj=on:i=3:si=on:rtra=on_0 on Vampire---4 for (2999ds/3Mi)
% 0.16/0.33 % (27877)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on Vampire---4 for (2999ds/18Mi)
% 0.16/0.33 % (27875)lrs+1002_1:128_aac=none:au=on:cnfonf=lazy_not_gen_be_off:sos=all:i=2:si=on:rtra=on_0 on Vampire---4 for (2999ds/2Mi)
% 0.16/0.33 % (27874)Instruction limit reached!
% 0.16/0.33 % (27874)------------------------------
% 0.16/0.33 % (27874)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.16/0.33 % (27874)Termination reason: Unknown
% 0.16/0.33 % (27874)Termination phase: Function definition elimination
% 0.16/0.33
% 0.16/0.33 % (27874)Memory used [KB]: 1023
% 0.16/0.33 % (27874)Time elapsed: 0.003 s
% 0.16/0.33 % (27874)Instructions burned: 3 (million)
% 0.16/0.33 % (27874)------------------------------
% 0.16/0.33 % (27874)------------------------------
% 0.16/0.33 % (27878)Instruction limit reached!
% 0.16/0.33 % (27878)------------------------------
% 0.16/0.33 % (27878)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.16/0.33 % (27878)Termination reason: Unknown
% 0.16/0.33 % (27878)Termination phase: Property scanning
% 0.16/0.33
% 0.16/0.33 % (27878)Memory used [KB]: 1023
% 0.16/0.33 % (27878)Time elapsed: 0.003 s
% 0.16/0.33 % (27878)Instructions burned: 3 (million)
% 0.16/0.33 % (27878)------------------------------
% 0.16/0.33 % (27878)------------------------------
% 0.16/0.33 % (27872)Instruction limit reached!
% 0.16/0.33 % (27872)------------------------------
% 0.16/0.33 % (27872)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.16/0.33 % (27872)Termination reason: Unknown
% 0.16/0.33 % (27872)Termination phase: Saturation
% 0.16/0.33
% 0.16/0.33 % (27872)Memory used [KB]: 5500
% 0.16/0.33 % (27872)Time elapsed: 0.004 s
% 0.16/0.33 % (27872)Instructions burned: 4 (million)
% 0.16/0.33 % (27872)------------------------------
% 0.16/0.33 % (27872)------------------------------
% 0.16/0.33 % (27876)Refutation not found, incomplete strategy
% 0.16/0.33 % (27876)------------------------------
% 0.16/0.33 % (27876)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.16/0.33 % (27875)Instruction limit reached!
% 0.16/0.33 % (27875)------------------------------
% 0.16/0.33 % (27875)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.16/0.33 % (27875)Termination reason: Unknown
% 0.16/0.33 % (27875)Termination phase: Function definition elimination
% 0.16/0.33
% 0.16/0.33 % (27875)Memory used [KB]: 1023
% 0.16/0.33 % (27875)Time elapsed: 0.003 s
% 0.16/0.33 % (27875)Instructions burned: 3 (million)
% 0.16/0.33 % (27875)------------------------------
% 0.16/0.33 % (27875)------------------------------
% 0.16/0.33 % (27876)Termination reason: Refutation not found, incomplete strategy
% 0.16/0.33
% 0.16/0.33
% 0.16/0.33 % (27876)Memory used [KB]: 5500
% 0.16/0.33 % (27876)Time elapsed: 0.004 s
% 0.16/0.33 % (27876)Instructions burned: 3 (million)
% 0.16/0.33 % (27876)------------------------------
% 0.16/0.33 % (27876)------------------------------
% 0.16/0.33 % (27871)First to succeed.
% 0.16/0.33 % (27873)Also succeeded, but the first one will report.
% 0.16/0.33 % (27871)Refutation found. Thanks to Tanya!
% 0.16/0.33 % SZS status Theorem for Vampire---4
% 0.16/0.33 % SZS output start Proof for Vampire---4
% 0.16/0.33 thf(func_def_0, type, in: $i > ($i > $o) > $o).
% 0.16/0.33 thf(func_def_2, type, is_a: $i > ($i > $o) > $o).
% 0.16/0.33 thf(func_def_3, type, emptyset: $i > $o).
% 0.16/0.33 thf(func_def_4, type, unord_pair: $i > $i > $i > $o).
% 0.16/0.33 thf(func_def_5, type, singleton: $i > $i > $o).
% 0.16/0.33 thf(func_def_6, type, union: ($i > $o) > ($i > $o) > $i > $o).
% 0.16/0.33 thf(func_def_7, type, excl_union: ($i > $o) > ($i > $o) > $i > $o).
% 0.16/0.33 thf(func_def_8, type, intersection: ($i > $o) > ($i > $o) > $i > $o).
% 0.16/0.33 thf(func_def_9, type, setminus: ($i > $o) > ($i > $o) > $i > $o).
% 0.16/0.33 thf(func_def_10, type, complement: ($i > $o) > $i > $o).
% 0.16/0.33 thf(func_def_11, type, disjoint: ($i > $o) > ($i > $o) > $o).
% 0.16/0.33 thf(func_def_12, type, subset: ($i > $o) > ($i > $o) > $o).
% 0.16/0.33 thf(func_def_13, type, meets: ($i > $o) > ($i > $o) > $o).
% 0.16/0.33 thf(func_def_14, type, misses: ($i > $o) > ($i > $o) > $o).
% 0.16/0.33 thf(func_def_28, type, sK0: $i > $o).
% 0.16/0.33 thf(func_def_31, type, ph3: !>[X0: $tType]:(X0)).
% 0.16/0.33 thf(f114,plain,(
% 0.16/0.33 $false),
% 0.16/0.33 inference(avatar_sat_refutation,[],[f95,f99,f109])).
% 0.16/0.33 thf(f109,plain,(
% 0.16/0.33 ~spl2_1),
% 0.16/0.33 inference(avatar_contradiction_clause,[],[f108])).
% 0.16/0.33 thf(f108,plain,(
% 0.16/0.33 $false | ~spl2_1),
% 0.16/0.33 inference(trivial_inequality_removal,[],[f100])).
% 0.16/0.33 thf(f100,plain,(
% 0.16/0.33 ($true = $false) | ~spl2_1),
% 0.16/0.33 inference(superposition,[],[f90,f96])).
% 0.16/0.33 thf(f96,plain,(
% 0.16/0.33 ((sK0 @ sK5) = $false)),
% 0.16/0.33 inference(subsumption_resolution,[],[f85,f74])).
% 0.16/0.33 thf(f74,plain,(
% 0.16/0.33 ( ! [X1 : $i] : (((sK0 @ X1) = $false) | (sK1 = X1)) )),
% 0.16/0.33 inference(equality_proxy_clausification,[],[f73])).
% 0.16/0.33 thf(f73,plain,(
% 0.16/0.33 ( ! [X1 : $i] : (((sK0 @ X1) = $false) | ($true = (sK1 = X1))) )),
% 0.16/0.33 inference(binary_proxy_clausification,[],[f72])).
% 0.16/0.33 thf(f72,plain,(
% 0.16/0.33 ( ! [X1 : $i] : ((((sK0 @ X1) => (sK1 = X1)) = $true)) )),
% 0.16/0.33 inference(beta_eta_normalization,[],[f71])).
% 0.16/0.33 thf(f71,plain,(
% 0.16/0.33 ( ! [X1 : $i] : (($true = ((^[Y0 : $i]: ((sK0 @ Y0) => (sK1 = Y0))) @ X1))) )),
% 0.16/0.33 inference(pi_clausification,[],[f70])).
% 0.16/0.33 thf(f70,plain,(
% 0.16/0.33 ((!! @ $i @ (^[Y0 : $i]: ((sK0 @ Y0) => (sK1 = Y0)))) = $true)),
% 0.16/0.33 inference(beta_eta_normalization,[],[f67])).
% 0.16/0.33 thf(f67,plain,(
% 0.16/0.33 (((^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (!! @ $i @ (^[Y2 : $i]: ((Y0 @ Y2) => (Y1 @ Y2))))))) @ sK0 @ ((^[Y0 : $i]: ((^[Y1 : $i]: (Y0 = Y1)))) @ sK1)) = $true)),
% 0.16/0.33 inference(definition_unfolding,[],[f60,f50,f51])).
% 0.16/0.33 thf(f51,plain,(
% 0.16/0.33 (singleton = (^[Y0 : $i]: ((^[Y1 : $i]: (Y0 = Y1)))))),
% 0.16/0.33 inference(cnf_transformation,[],[f23])).
% 0.16/0.33 thf(f23,plain,(
% 0.16/0.33 (singleton = (^[Y0 : $i]: ((^[Y1 : $i]: (Y0 = Y1)))))),
% 0.16/0.33 inference(fool_elimination,[],[f22])).
% 0.16/0.33 thf(f22,plain,(
% 0.16/0.33 (singleton = (^[X0 : $i, X1 : $i] : ((X0 = X1))))),
% 0.16/0.33 inference(rectify,[],[f5])).
% 0.16/0.33 thf(f5,axiom,(
% 0.16/0.33 (singleton = (^[X0 : $i, X3 : $i] : ((X0 = X3))))),
% 0.16/0.33 file('/export/starexec/sandbox2/tmp/tmp.1VpC4oaq5b/Vampire---4.8_27763',singleton)).
% 0.16/0.33 thf(f50,plain,(
% 0.16/0.33 (subset = (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (!! @ $i @ (^[Y2 : $i]: ((Y0 @ Y2) => (Y1 @ Y2))))))))),
% 0.16/0.33 inference(cnf_transformation,[],[f34])).
% 0.16/0.33 thf(f34,plain,(
% 0.16/0.33 (subset = (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (!! @ $i @ (^[Y2 : $i]: ((Y0 @ Y2) => (Y1 @ Y2))))))))),
% 0.16/0.33 inference(fool_elimination,[],[f33])).
% 0.16/0.33 thf(f33,plain,(
% 0.16/0.33 ((^[X0 : $i > $o, X1 : $i > $o] : (! [X2] : ((X0 @ X2) => (X1 @ X2)))) = subset)),
% 0.16/0.33 inference(rectify,[],[f12])).
% 0.16/0.33 thf(f12,axiom,(
% 0.16/0.33 ((^[X0 : $i > $o, X2 : $i > $o] : (! [X3] : ((X0 @ X3) => (X2 @ X3)))) = subset)),
% 0.16/0.33 file('/export/starexec/sandbox2/tmp/tmp.1VpC4oaq5b/Vampire---4.8_27763',subset)).
% 0.16/0.33 thf(f60,plain,(
% 0.16/0.33 ((subset @ sK0 @ (singleton @ sK1)) = $true)),
% 0.16/0.33 inference(cnf_transformation,[],[f48])).
% 0.16/0.33 thf(f48,plain,(
% 0.16/0.33 ((subset @ sK0 @ (singleton @ sK1)) = $true) & ((singleton @ sK1) != sK0) & (emptyset != sK0)),
% 0.16/0.33 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f46,f47])).
% 0.16/0.33 thf(f47,plain,(
% 0.16/0.33 ? [X0 : $i > $o,X1] : (($true = (subset @ X0 @ (singleton @ X1))) & ((singleton @ X1) != X0) & (emptyset != X0)) => (((subset @ sK0 @ (singleton @ sK1)) = $true) & ((singleton @ sK1) != sK0) & (emptyset != sK0))),
% 0.16/0.33 introduced(choice_axiom,[])).
% 0.16/0.33 thf(f46,plain,(
% 0.16/0.33 ? [X0 : $i > $o,X1] : (($true = (subset @ X0 @ (singleton @ X1))) & ((singleton @ X1) != X0) & (emptyset != X0))),
% 0.16/0.33 inference(flattening,[],[f45])).
% 0.16/0.33 thf(f45,plain,(
% 0.16/0.33 ? [X0 : $i > $o,X1] : (((emptyset != X0) & ((singleton @ X1) != X0)) & ($true = (subset @ X0 @ (singleton @ X1))))),
% 0.16/0.33 inference(ennf_transformation,[],[f27])).
% 0.16/0.33 thf(f27,plain,(
% 0.16/0.33 ~! [X0 : $i > $o,X1] : (($true = (subset @ X0 @ (singleton @ X1))) => ((emptyset = X0) | ((singleton @ X1) = X0)))),
% 0.16/0.33 inference(fool_elimination,[],[f26])).
% 0.16/0.33 thf(f26,plain,(
% 0.16/0.33 ~! [X0 : $i > $o,X1] : ((subset @ X0 @ (singleton @ X1)) => (((singleton @ X1) = X0) | (emptyset = X0)))),
% 0.16/0.33 inference(rectify,[],[f16])).
% 0.16/0.33 thf(f16,negated_conjecture,(
% 0.16/0.33 ~! [X0 : $i > $o,X2] : ((subset @ X0 @ (singleton @ X2)) => (((singleton @ X2) = X0) | (emptyset = X0)))),
% 0.16/0.33 inference(negated_conjecture,[],[f15])).
% 0.16/0.33 thf(f15,conjecture,(
% 0.16/0.33 ! [X0 : $i > $o,X2] : ((subset @ X0 @ (singleton @ X2)) => (((singleton @ X2) = X0) | (emptyset = X0)))),
% 0.16/0.33 file('/export/starexec/sandbox2/tmp/tmp.1VpC4oaq5b/Vampire---4.8_27763',thm)).
% 0.16/0.33 thf(f85,plain,(
% 0.16/0.33 ((sK0 @ sK5) = $false) | (sK1 != sK5)),
% 0.16/0.33 inference(equality_proxy_clausification,[],[f84])).
% 0.16/0.33 thf(f84,plain,(
% 0.16/0.33 ((sK0 @ sK5) = $false) | ((sK1 = sK5) = $false)),
% 0.16/0.33 inference(binary_proxy_clausification,[],[f82])).
% 0.16/0.33 thf(f82,plain,(
% 0.16/0.33 ((sK1 = sK5) != (sK0 @ sK5))),
% 0.16/0.33 inference(negative_extensionality,[],[f75])).
% 0.16/0.33 thf(f75,plain,(
% 0.16/0.33 ((= @ sK1) != sK0)),
% 0.16/0.33 inference(beta_eta_normalization,[],[f68])).
% 0.16/0.33 thf(f68,plain,(
% 0.16/0.33 (((^[Y0 : $i]: ((^[Y1 : $i]: (Y0 = Y1)))) @ sK1) != sK0)),
% 0.16/0.33 inference(definition_unfolding,[],[f59,f51])).
% 0.16/0.33 thf(f59,plain,(
% 0.16/0.33 ((singleton @ sK1) != sK0)),
% 0.16/0.33 inference(cnf_transformation,[],[f48])).
% 0.16/0.33 thf(f90,plain,(
% 0.16/0.33 ((sK0 @ sK5) = $true) | ~spl2_1),
% 0.16/0.33 inference(avatar_component_clause,[],[f88])).
% 0.16/0.33 thf(f88,plain,(
% 0.16/0.33 spl2_1 <=> ((sK0 @ sK5) = $true)),
% 0.16/0.33 introduced(avatar_definition,[new_symbols(naming,[spl2_1])])).
% 0.16/0.33 thf(f99,plain,(
% 0.16/0.33 ~spl2_2),
% 0.16/0.33 inference(avatar_contradiction_clause,[],[f98])).
% 0.16/0.33 thf(f98,plain,(
% 0.16/0.33 $false | ~spl2_2),
% 0.16/0.33 inference(subsumption_resolution,[],[f97,f80])).
% 0.16/0.33 thf(f80,plain,(
% 0.16/0.33 ($false != (sK0 @ sK1))),
% 0.16/0.33 inference(superposition,[],[f77,f79])).
% 0.16/0.33 thf(f79,plain,(
% 0.16/0.33 (sK1 = sK4)),
% 0.16/0.33 inference(trivial_inequality_removal,[],[f78])).
% 0.16/0.33 thf(f78,plain,(
% 0.16/0.33 (sK1 = sK4) | ($false != $false)),
% 0.16/0.33 inference(superposition,[],[f77,f74])).
% 0.16/0.33 thf(f77,plain,(
% 0.16/0.33 ((sK0 @ sK4) != $false)),
% 0.16/0.33 inference(beta_eta_normalization,[],[f76])).
% 0.16/0.33 thf(f76,plain,(
% 0.16/0.33 ((sK0 @ sK4) != ((^[Y0 : $i]: ($false)) @ sK4))),
% 0.16/0.33 inference(negative_extensionality,[],[f69])).
% 0.16/0.33 thf(f69,plain,(
% 0.16/0.33 ((^[Y0 : $i]: ($false)) != sK0)),
% 0.16/0.33 inference(definition_unfolding,[],[f58,f49])).
% 0.16/0.33 thf(f49,plain,(
% 0.16/0.33 (emptyset = (^[Y0 : $i]: ($false)))),
% 0.16/0.33 inference(cnf_transformation,[],[f28])).
% 0.16/0.33 thf(f28,plain,(
% 0.16/0.33 (emptyset = (^[Y0 : $i]: ($false)))),
% 0.16/0.33 inference(fool_elimination,[],[f3])).
% 0.16/0.33 thf(f3,axiom,(
% 0.16/0.33 ((^[X0 : $i] : ($false)) = emptyset)),
% 0.16/0.33 file('/export/starexec/sandbox2/tmp/tmp.1VpC4oaq5b/Vampire---4.8_27763',emptyset)).
% 0.16/0.33 thf(f58,plain,(
% 0.16/0.33 (emptyset != sK0)),
% 0.16/0.33 inference(cnf_transformation,[],[f48])).
% 0.16/0.33 thf(f97,plain,(
% 0.16/0.33 ($false = (sK0 @ sK1)) | ~spl2_2),
% 0.16/0.33 inference(superposition,[],[f96,f94])).
% 0.16/0.33 thf(f94,plain,(
% 0.16/0.33 (sK1 = sK5) | ~spl2_2),
% 0.16/0.33 inference(avatar_component_clause,[],[f92])).
% 0.16/0.33 thf(f92,plain,(
% 0.16/0.33 spl2_2 <=> (sK1 = sK5)),
% 0.16/0.33 introduced(avatar_definition,[new_symbols(naming,[spl2_2])])).
% 0.16/0.33 thf(f95,plain,(
% 0.16/0.33 spl2_1 | spl2_2),
% 0.16/0.33 inference(avatar_split_clause,[],[f86,f92,f88])).
% 0.16/0.33 thf(f86,plain,(
% 0.16/0.33 ((sK0 @ sK5) = $true) | (sK1 = sK5)),
% 0.16/0.33 inference(equality_proxy_clausification,[],[f83])).
% 0.16/0.33 thf(f83,plain,(
% 0.16/0.33 ((sK0 @ sK5) = $true) | ((sK1 = sK5) = $true)),
% 0.16/0.33 inference(binary_proxy_clausification,[],[f82])).
% 0.16/0.33 % SZS output end Proof for Vampire---4
% 0.16/0.33 % (27871)------------------------------
% 0.16/0.33 % (27871)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.16/0.33 % (27871)Termination reason: Refutation
% 0.16/0.33
% 0.16/0.33 % (27871)Memory used [KB]: 5500
% 0.16/0.33 % (27871)Time elapsed: 0.005 s
% 0.16/0.33 % (27871)Instructions burned: 4 (million)
% 0.16/0.33 % (27871)------------------------------
% 0.16/0.33 % (27871)------------------------------
% 0.16/0.33 % (27870)Success in time 0.006 s
% 0.16/0.33 % Vampire---4.8 exiting
%------------------------------------------------------------------------------